The relationship between IR, optical, and UV extinction

An analysis is presented for the variability of absolute IR, optical, and UV extinction, A(sub lambda), derived through the ratio of total-to-selective extinction, R, for 31 lines of sight for which reliable UV extinction parameters were derived. These data sample a wide range of environments and are characterized by 2.5 is less than or equal to R is less than or equal to 6.0. It was found that there is a strong linear dependence between extinction expressed as A(sub lambda)/A(sub V) and 1/R for 1.25 micron is less than or equal to lambda is less than or equal to 0.12 micron. Differences in the general shape of extinction curves are largely due to variations in shape of optical/near-UV extinction corresponding to changes in R, with A(sub lambda)/A(sub V) decreasing for increasing R. From a least-squares fit of the observed R-dependence as a function of wavelength for 0.8/micron is less than or greater than 1/lambda is less than or equal to 8.3/micron, an analytic expression was generated from which IR, optical, and UV extinction curves of the form A(sub lambda)/A(sub V) can be reproduced with reasonable accuracy from a knowledge of R. It was also found that the absolute bump strength normalized to A(sub V) shows a general decrease with increasing R, suggesting that some fraction of bump grains may be selectively incorporated into coagulated grains. Finally, it was found that absolute extinction normalized by suitably chosen color indices results in a minimization of the R-dependence of portions of the UV curve, allowing A(sub lambda) to be estimated for these wavelengths independent of R

Syntactic Markovian Bisimulation for Chemical Reaction Networks

In chemical reaction networks (CRNs) with stochastic semantics based on continuous-time Markov chains (CTMCs), the typically large populations of species cause combinatorially large state spaces. This makes the analysis very difficult in practice and represents the major bottleneck for the applicability of minimization techniques based, for instance, on lumpability. In this paper we present syntactic Markovian bisimulation (SMB), a notion of bisimulation developed in the Larsen-Skou style of probabilistic bisimulation, defined over the structure of a CRN rather than over its underlying CTMC. SMB identifies a lumpable partition of the CTMC state space a priori, in the sense that it is an equivalence relation over species implying that two CTMC states are lumpable when they are invariant with respect to the total population of species within the same equivalence class. We develop an efficient partition-refinement algorithm which computes the largest SMB of a CRN in polynomial time in the number of species and reactions. We also provide an algorithm for obtaining a quotient network from an SMB that induces the lumped CTMC directly, thus avoiding the generation of the state space of the original CRN altogether. In practice, we show that SMB allows significant reductions in a number of models from the literature. Finally, we study SMB with respect to the deterministic semantics of CRNs based on ordinary differential equations (ODEs), where each equation gives the time-course evolution of the concentration of a species. SMB implies forward CRN bisimulation, a recently developed behavioral notion of equivalence for the ODE semantics, in an analogous sense: it yields a smaller ODE system that keeps track of the sums of the solutions for equivalent species.Comment: Extended version (with proofs), of the corresponding paper published at KimFest 2017 (http://kimfest.cs.aau.dk/

Process algebra modelling styles for biomolecular processes

We investigate how biomolecular processes are modelled in process algebras, focussing on chemical reactions. We consider various modelling styles and how design decisions made in the definition of the process algebra have an impact on how a modelling style can be applied. Our goal is to highlight the often implicit choices that modellers make in choosing a formalism, and illustrate, through the use of examples, how this can affect expressability as well as the type and complexity of the analysis that can be performed

Concurrent constraint programming with process mobility

We propose an extension of concurrent constraint programming with primitives for process migration within a hierarchical network, and we study its semantics. To this purpose, we first investigate a "pure " paradigm for process migration, namely a paradigm where the only actions are those dealing with transmissions of processes. Our goal is to give a structural definition of the semantics of migration; namely, we want to describe the behaviour of the system, during the transmission of a process, in terms of the behaviour of the components. We achieve this goal by using a labeled transition system where the effects of sending a process, and requesting a process, are modeled by symmetric rules (similar to handshaking-rules for synchronous communication) between the two partner nodes in the network. Next, we extend our paradigm with the primitives of concurrent constraint programming, and we show how to enrich the semantics to cope with the notions of environment and constraint store. Finally, we show how the operational semantics can be used to define an interpreter for the basic calculus.

Regulating Data Exchange in Service Oriented Applications

We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining data exchanges in terms of sets of service partner names attachable to each single datum. Service programmers explicitly write only the annotations necessary to specify the wanted policies for communicable data, while a type inference system (statically) derives the minimal additional annotations that ensure consistency of services initial configuration. Then, the language dynamic semantics only performs very simple checks to authorize or block communication. We prove that the type system and the operational semantics are sound. As a consequence, we have the following data protection property: services always comply with the policies regulating the exchange of data among interacting services. We illustrate our approach through a simplified but realistic scenario for a service-based electronic marketplace

The Effect of Dust Extinction on the Observed Properties of Galaxies in the Near-Infrared

Galaxies behind the Milky Way suffer size reduction and dimming due to their obscuration by dust in the disk of our Galaxy. The degree of obscuration is wavelength dependent. It decreases towards longer wavelengths. Compared to the optical, the Near InfraRed (NIR) $K_s$ band extinction is only $\approx10$ that of the $B$ band. This makes NIR surveys well suited for galaxy surveys close to the Galactic Plane where extinction is severe. While Galactic obscuration is less prominent in the NIR it is not negligible. In this paper we derive empirical relations to correct isophotal radii and magnitudes of galaxies observed in the NIR for foreground absorption. We simulate extinction in the $J$, $H$ and $K_s$ bands on 64 (unobscured) galaxies from the 2MASS Large Galaxy Atlas \citep{jarrett}. We propose two methods for the extinction correction, the first is optimized to provide the most accurate correction and the second provides a convenient statistical correction that works adequately in lower extinction regions. The optimized correction utilizes the galaxy surface brightness, either the disk central surface brightness, $\mu_0$, or the combined disk plus bulge central surface brightness, elliptical and disk/spiral Hubble types. A detailed comparison between the different methods and their accuracy is provided.Comment: 9 pages, 8 figures and 8 tables. Accepted by the MNRAS: Accepted 2009 September 18. Received 2009 September 18; in original form 2009 July 1

A Flexible and Modular Framework for Implementing Infrastructures for Global Computing

We present a Java software framework for building infrastructures to support the development of applications for systems where mobility and network awareness are key issues. The framework is particularly useful to develop run-time support for languages oriented towards global computing. It enables platform designers to customize communication protocols and network architectures and guarantees transparency of name management and code mobility in distributed environments. The key features are illustrated by means of a couple of simple case studies

The Frascati Beam Test Facility

From 2004 the Frascati Beam Test Facility (BTF) in the DAFNE accelerator complex provides to the external user up to 1E10 electrons per bunch or up to 10E9 positrons per bunch to develop their detectors. After an upgrade program terminated in 2020 of the beam test facility a description of the status and available beam lines will be done.Comment: Talk presented at the International Workshop on Future Linear Colliders (LCWS 2023), 15-19 May 2023. C23-05-15.

Design and analysis of DNA strand displacement devices using probabilistic model checking

Designing correct, robust DNA devices is difficult because of the many possibilities for unwanted interference between molecules in the system. DNA strand displacement has been proposed as a design paradigm for DNA devices, and the DNA strand displacement (DSD) programming language has been developed as a means of formally programming and analysing these devices to check for unwanted interference. We demonstrate, for the first time, the use of probabilistic verification techniques to analyse the correctness, reliability and performance of DNA devices during the design phase. We use the probabilistic model checker prism, in combination with the DSD language, to design and debug DNA strand displacement components and to investigate their kinetics. We show how our techniques can be used to identify design flaws and to evaluate the merits of contrasting design decisions, even on devices comprising relatively few inputs. We then demonstrate the use of these components to construct a DNA strand displacement device for approximate majority voting. Finally, we discuss some of the challenges and possible directions for applying these methods to more complex designs